Derivation of Efficient, Continuous, Explicit Runge-Kutta Methods
نویسندگان
چکیده
Continuous Explicit Runge-Kutta methods with the minimal number of stages are considered. These methods are continuously diierentiable if and only if one of the stages is the FSAL evaluation. A characterization of a subclass of these methods is developed for order 3,4 and 5. It is shown how the free parameters of these methods can be used either to minimize the continuous truncation error coeecients or to maximize the stability region. As a representative for these methods the 5th order method with minimized error coeecients is chosen, supplied with an error estimation method, and analysed by using the DETEST software. The results are compared with a similar implementation of the Dormand-Prince 5(4) pair with interpolant, showing a signiicant advantage to the new method for the chosen problems.
منابع مشابه
A Survey of the Explicit Runge-Kutta Method
Research in explicit Runge-Kutta methods is producing continual improvements to the original algorithms, and the aim of this survey is to relate the current state-of-the-art. In drawing attention to recent advances, we hope to provide useful information for those who apply numerical methods. We describe recent work in the derivation of Runge-Kutta coeecients: \classical" general-purpose formula...
متن کاملA Survey of the Explicit Runge - Kutta Method ( Revised April
Research in explicit Runge-Kutta methods is producing continual improvements to the original algorithms , and the aim of this survey is to relate the current state-of-the-art. In drawing attention to recent advances, we hope to provide useful information for those who apply numerical methods. We describe recent work in the derivation of Runge-Kutta coeecients: \classical" general-purpose formul...
متن کاملForward and adjoint sensitivity analysis with continuous explicit Runge - Kutta methods ⋆
We study the numerical solution of tangent linear, first, and second order adjoint models with high-order explicit, continuous Runge-Kutta methods. The approaches currently implemented in popular packages such as SUNDIALS or DASPKADJOINT are based on linear multistep methods. For adaptive time integration of nonlinear models, interpolation of the forward model solution is required during the ad...
متن کاملGlobal Error versus Tolerance for Explicit Runge-Kutta Methods
Initial value solvers typically input a problem specification and an error tolerance, and output an approximate solution. Faced with this situation many users assume, or hope for, a linear relationship between the global error and the tolerance. In this paper we examine the potential for such 'tolerance proportionality' in existing explicit Runge-Kutta algorithms. We take account of recent deve...
متن کامل2-stage explicit total variation diminishing preserving Runge-Kutta methods
In this paper, we investigate the total variation diminishing property for a class of 2-stage explicit Rung-Kutta methods of order two (RK2) when applied to the numerical solution of special nonlinear initial value problems (IVPs) for (ODEs). Schemes preserving the essential physical property of diminishing total variation are of great importance in practice. Such schemes are free of spurious o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 1992